package leetcode100;

/**
 * @author shkstart
 * @create 2022-12-28-23:37
 */
public class Meme26_1 {
    public class Solution {
        public int JumpFloorII(int target) {
//整数x*2^n = x<<n;
//2^(target-1)=1*2^(target-1)
            return 1<<--target;
        }
    }

}
